package com.singzi.algorithm;

import java.util.ArrayList;
import java.util.Arrays;

public class DyProgram {

    /**
     * 1 确定 dp数组的含义
     * 2 确定 dp递推公式
     * 3 初始化 dp公式
     */
    public static void main(String[] args) {

        ArrayList<int[]> list = new ArrayList<>();
        for (int i = 0; i < 10; i++) {
            int []num = new int[2];
            num[0] = 1;
            num[1] = i;
            list.add(num);

        }
        int []num = new int[2];
        num[0] = 10;
        num[1] =100;
        for (int i = 0; i < list.size(); i++) {
            System.out.println(Arrays.toString(list.get(i)));
        }
        System.out.println(list.contains(num));

        int n =10;
        int []dp = new int [n];
        int [][]nums = new int[5][5];
        System.out.println(nums.length);
        System.out.println(nums[0].length);
        //1 确定 dp数组的含义
        dp[0] = 1;
        dp[1] = 1;
        //确定dp递推公式


    }

}
